package com.wc.alorithm_blue_bridge._思维.老君炼丹;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.PriorityQueue;
import java.util.StringTokenizer;

/**
 * @Author congge
 * @Date 2024/7/29 16:17
 * @description https://www.lanqiao.cn/problems/19744/learning/?contest_id=197
 */
public class Main {
    /**
     * 思路：
     * 想到合并
     * 是不是只可能是4种情况,
     * 大大合并 可能一方非常大, 导致消耗了另一方的小的, 生成了小的, 与题目向北了
     * 小小合并 完美解决, 小小合并, 生成的也是小的
     * 大小合并 过多的消耗小的了
     * 小大合并 同上
     */
    static FastReader sc = new FastReader();
    static PrintWriter out = new PrintWriter(System.out);
    static int N = 1010;
    static PriorityQueue<Integer> q1 = new PriorityQueue<>(), q2 = new PriorityQueue<>((o1, o2) -> o2 - o1);
    static int n;

    public static void main(String[] args) {
        n = sc.nextInt();
        for (int i = 1; i <= n; i++) {
            int x = sc.nextInt();
            if (x > 0) q1.add(x);
            else if (x < 0) q2.add(x);
        }
        while ((!q1.isEmpty()) && (!q2.isEmpty())) {
            int x = q1.poll() + q2.poll();
            if (x > 0) q1.add(x);
            else if (x < 0) q2.add(x);
        }
        if (q1.size() == 1 || q2.size() == 1 || (q1.size() == 0 && q2.size() == 0)) out.println("Y");
        else out.println("N");
        out.flush();
    }
}

class FastReader {
    StringTokenizer st;
    BufferedReader br;

    FastReader() {
        br = new BufferedReader(new InputStreamReader(System.in));
    }

    String next() {
        while (st == null || !st.hasMoreElements()) {
            try {
                st = new StringTokenizer(br.readLine());
            } catch (IOException e) {
                e.printStackTrace();
            }
        }
        return st.nextToken();
    }

    int nextInt() {
        return Integer.parseInt(next());
    }

    String nextLine() {
        String s = "";
        try {
            s = br.readLine();
        } catch (IOException e) {
            e.printStackTrace();
        }
        return s;
    }

    long nextLong() {
        return Long.parseLong(next());
    }

    double nextDouble() {
        return Double.parseDouble(next());
    }

    // 是否由下一个
    boolean hasNext() {
        while (st == null || !st.hasMoreTokens()) {
            try {
                String line = br.readLine();
                if (line == null)
                    return false;
                st = new StringTokenizer(line);
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return true;
    }
}
